منابع مشابه
Pythagorean triples, rational angles, and space-filling simplices
The ancient Greeks posed and solved the problem of finding all right triangles with rational sidelengths. There are 4 natural nonEuclidean generalizations of this problem. We solve them all. The result is that the only rational-sided nonEuclidean triangle with one right angle is the isoceles spherical triangle with legs of length 45 and hypotenuse 60. We next ask which simplices have rational d...
متن کاملBalanced Simplices
An additive cellular automaton is a linear map on the set of infinite multidimensional arrays of elements in a finite cyclic group Z/mZ. In this paper, we consider simplices appearing in the orbits generated from arithmetic arrays by additive cellular automata. We prove that they constitute a source of balanced simplices, that are simplices containing all the elements of Z/mZ with the same mult...
متن کاملMarching Simplices
A multi-dimensional algorithm for surface extraction from a structured domain is presented. Topological information is used to split the n-cubes into simplices which are used to extract the possible configurations of new surface elements. The algorithm is intended to complement to the existing surface extraction algorithms, which are specialized to deal with a set dimension, while this algorith...
متن کاملQuadratically Many Colorful Simplices
The colorful Carathéodory theorem asserts that if X1, X2, . . . , Xd+1 are sets in R, each containing the origin 0 in its convex hull, then exists a set S ⊆ X1 ∪ · · · ∪ Xd+1 with |S ∩ Xi| = 1 for all i = 1, 2, . . . , d + 1 and 0 ∈ conv(S) (we call conv(S) a colorful covering simplex). Deza, Huang, Stephen and Terlaky proved that if the Xi are in general position with respect to 0 (consequentl...
متن کاملContainment and Inscribed Simplices
Let K and L be compact convex sets in Rn. The following two statements are shown to be equivalent: (i) For every polytope Q ⊆ K having at most n+ 1 vertices, L contains a translate of Q. (ii) L contains a translate of K. Let 1 ≤ d ≤ n − 1. It is also shown that the following two statements are equivalent: (i) For every polytope Q ⊆ K having at most d+ 1 vertices, L contains a translate of Q. (i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1999
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(98)00117-7